On Adversary Robust Consensus Protocols Through Joint-Agent Interactions

نویسندگان

چکیده

A generalized family of adversary robust consensus protocols is proposed and analyzed. These are distributed algorithms for multiagent systems seeking to agree on a common value shared variable, even in the presence faulty or malicious agents, which updating their local state according protocol rules. In particular, we adopt monotone joint-agent interactions, very general mechanism processing locally available information allowing cross-comparisons between state-values multiple agents simultaneously. The salient features class abstracted as Petri net convergence criteria resulting time evolutions formulated by employing structural invariants net.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Protocols on General Hybrid Adversary Structures

Most of the literature of fault tolerant computing applies a threshold point of view: for a given number n of parties, there is a constant t such that up to t failures can be tolerated. In the real world, there are dependencies between failures; if a program crashes because of an incompatibility with the operating system, other parties with the same operating system are more likely to crash as ...

متن کامل

Consensus of Multi-Agent Systems under the Special Consensus Protocols

Two consensus problems are considered in this paper. One is the consensus of linear multi-agent systems with weakly connected directed communication topology. The other is the consensus of nonlinear multi-agent systems with strongly connected directed communication topology. For the first problem, a simplified consensus protocol is designed: Each child agent can only communicate with one of its...

متن کامل

Multi-agent Robust Consensus: Convergence Analysis

This part of the paper investigates a robust consensus problem for continuous-time multi-agent systems with time-varying communication graphs and weight functions. Convergence rates are presented explicitly with respect to L∞ and L1 norms of disturbances. Sufficient and/or necessary connectivity conditions are obtained for the system to reach robust consensus or integral robust consensus.

متن کامل

On Consensus under Polynomial Protocols

In this paper we explore the possibility of using computational algebraic methods to analyze a class of consensus protocols. We state some necessary conditions for convergence under consensus protocols that are polynomials.

متن کامل

Distributed Consensus Protocols in Adaptive Multi-Agent Systems

The analysis of noisy consensus dynamics in networks is of great interest to both advance the fundamental understanding of multi-agent systems in nature as well as create robust decentralized engineering systems. We develop a protocol that heuristically attempts to optimize metrics of consensus dynamics without explicitly measuring a network’s global properties. Adopting the approach of utility...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2021

ISSN: ['0018-9286', '1558-2523', '2334-3303']

DOI: https://doi.org/10.1109/tac.2020.3002251